Semantics of Exact Real Arithmetic

نویسندگان

  • Peter John Potts
  • Abbas Edalat
  • Martín Hötzel Escardó
چکیده

In this paper, we incorporate a representation of the non-negative extended real numbers based on the composition of linear fractional transformations with non-negative integer coeecients into the Programming Language for Computable Functions (PCF) with products. We present two models for the extended language and show that they are computationally adequate with respect to the operational semantics.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Domain Theory and its Applications

Michael Baldamus An Elementary Set–Theoretic Semantics for the π–Calculus . . . . . . . . . . . 6 Andrej Bauer Recursive Analysis in PER(PN) . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Eike Best Relational Semantics Revisited . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 Marcello Bonsague Infinitary Logic of Domains . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....

متن کامل

A New Interpretation of the Semantics of "Moral Obligation" from Allame Tabatabaie's Viewpoint

The most important part in analyzing moral concepts includes those used as predicate in moral sentences covering moral concepts of valuation and obligation. Moral concepts in the field of values include those like “good” and “bad” while obligatory concepts include “ought to” and “ought no” and “duty”. Many papers have been written about “moral obligation”; however, dissociating the area of sema...

متن کامل

Constructive analysis, types and exact real numbers

In the present paper, we will discuss various aspects of computable/constructive analysis, namely semantics, proofs and computations. We will present some of the problems and solutions of exact real arithmetic varying from concrete implementations, representation and algorithms to various models for real computation. We then put these models in a uniform framework using realisability, opening t...

متن کامل

Coinductive Formal Reasoning in Exact Real Arithmetic

In this article we present a method for formally proving the correctness of the lazy algorithms for computing homographic and quadratic transformations — of which field operations are special cases— on a representation of real numbers by coinductive streams. The algorithms work on coinductive stream of Möbius maps and form the basis of the Edalat–Potts exact real arithmetic. We use the machiner...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997